Dynamic problem

Results: 444



#Item
41Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 ·

Geoinformatica DOIs10707Task selection in spatial crowdsourcing from worker’s perspective Dingxiong Deng1 · Cyrus Shahabi1 ·

Add to Reading List

Source URL: infolab.usc.edu

Language: English - Date: 2016-05-21 03:16:43
42Learning About The Future and Dynamic E¢ ciency Alex Gershkov and Benny Moldovanu1We

Learning About The Future and Dynamic E¢ ciency Alex Gershkov and Benny Moldovanu1We

Add to Reading List

Source URL: www.econ2.uni-bonn.de

Language: English - Date: 2014-03-26 06:49:17
43Learning About The Future and Dynamic E¢ ciency Alex Gershkov and Benny Moldovanu1We

Learning About The Future and Dynamic E¢ ciency Alex Gershkov and Benny Moldovanu1We

Add to Reading List

Source URL: pluto.huji.ac.il

Language: English - Date: 2014-02-02 05:15:06
44APPROXIMATE DYNAMIC PROGRAMMING A SERIES OF LECTURES GIVEN AT TSINGHUA UNIVERSITY JUNE 2014 DIMITRI P. BERTSEKAS Based on the books:

APPROXIMATE DYNAMIC PROGRAMMING A SERIES OF LECTURES GIVEN AT TSINGHUA UNIVERSITY JUNE 2014 DIMITRI P. BERTSEKAS Based on the books:

Add to Reading List

Source URL: athenasc.com

Language: English - Date: 2014-06-21 10:19:49
45Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I

Sutra: International Journal of Mathematical Science Education, Technomathematics Research Foundation Vol. 1, No. 1, , 2008 CLASS-ROOM NOTES: OPTIMIZATION PROBLEM SOLVING - I

Add to Reading List

Source URL: www.tmrfindia.org

Language: English - Date: 2008-11-10 09:49:21
46CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

CS261: A Second Course in Algorithms Lecture #19: Beating Brute-Force Search∗ Tim Roughgarden† March 8, 2016 A popular myth is that, for N P -hard problems, there are no algorithms with worst-case running time better

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2016-03-15 10:47:56
47Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Ant´ onio Morgado and Joao Marques-Silva School of Electronics and Computer Science, University of Southampton, UK ,jpms@e

Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem Ant´ onio Morgado and Joao Marques-Silva School of Electronics and Computer Science, University of Southampton, UK ,jpms@e

Add to Reading List

Source URL: ceur-ws.org

Language: English - Date: 2008-12-04 03:04:56
48One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2

One-Dimensional Partitioning for Heterogeneous Systems: Theory and Practice ⋆ Ali Pınar a,1, E. Kartal Tabak b and Cevdet Aykanat b,2

Add to Reading List

Source URL: www.sandia.gov

Language: English - Date: 2012-03-07 01:50:39
4921st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 2015 www.mssanz.org.au/modsim2015 Integrated planning of linear infrastructure and conservation offsets J. D. Bunton a, A. T

21st International Congress on Modelling and Simulation, Gold Coast, Australia, 29 Nov to 4 Dec 2015 www.mssanz.org.au/modsim2015 Integrated planning of linear infrastructure and conservation offsets J. D. Bunton a, A. T

Add to Reading List

Source URL: www.mssanz.org.au

Language: English - Date: 2015-12-13 21:36:42
50Microsoft Word - IBSAI and DM.doc

Microsoft Word - IBSAI and DM.doc

Add to Reading List

Source URL: foibg.com

Language: English - Date: 2015-02-02 08:44:11